Flows in Undirected Unit Capacity Networks
نویسندگان
چکیده
We describe an O(min(m,n3/2)m1/2)-time algorithm for finding maximum flows in undirected networks with unit capacities and no parallel edges. This improves upon the previous bound of Karzanov and Even and Tarjan when m = ω(n3/2), and upon a randomized bound of Karger when v = Ω(n7/4/m1/2).
منابع مشابه
Reducing Directed Max Flow to Undirected Max Flow and Bipartite Matching
In this paper, we prove two new results related to finding maximum flows in directed graphs and finding maximum matchings in bipartite graphs. In our first result, we derive a new algorithm for finding maximum flows in directed graphs. Our algorithm works by reducing a maximum flow problem on a directed graph to a maximum flow problem on an undirected graph, and running the Karger-Levine algori...
متن کاملMinimum Flows in Bipartite Networks with Unit Capacities
In this paper we study minimum flow algorithms in bipartite networks with unit capacities combining the algorithms for minimum flow in bipartite networks with the algorithms for minimum flow in unit capacity networks. Key–Words: Network flows, minimum flow problem, unit capacity networks, bipartite networks, maximum cut.
متن کاملComputing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in an undirected planar EVC-network to the minimum edge-cut problem in another planar network with edge capacity only (EC-network), thus the minimum-cut or the maximum flow value can be computed in O(n log n) time. Based on this r...
متن کاملBalanced Network Flows
Let G be a simple, undirected graph. A special network N, called a balanced network, is constructed from G such that maximum matchings and f-factors in G correspond to maximum flows in N. A max-balancedflow-min-balanced-cut theorem is proved for balanced networks. It is shown that Tutte’s Factor Theorem is equivalent to this network flow theorem, and that f-barriers are equivalent to minimum ba...
متن کاملMulticommodity Flows in Polymatroidal Capacity Networks
A classical result in undirected edge-capaciated networks is the approximate optimality of routing (flow) for multiple-unicast: the min-cut upper bound is within a logarithmic factor of the number of sources of the max flow [2, 3]. In this paper we focus on extending this result to a more general network model, where there are joint polymatroidal constraints on the rates of the edges that meet ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997